I was just re-reading chapter 18 of the Griswolds's "The Icon Programming Language"; it is a very inspiring treatment of matching procedures, recognition of grammars, and parsing in Icon. That got me thinking about the courses I took long ago on compiler design and on finite state automata but I wonder if the availability of generators (and recursive generators) and coexpressions in the compiler implementation language doesn't affect the whole treatment of the subject. Maybe books written from within a Scheme viewpoint would be most sympathetic. (Scheme and Icon bear deep similarity don't they?) If any of the Icon experts here have found books on compiler design/automata/formal language theory (or string matching for that matter) that are particularly mappable to Icon, your recommendations would be appreciated.
